Characterising Meanders Qualitatively
نویسنده
چکیده
In this paper, a qualitative shape representation is described for the purpose of characterising linear geographical and artificial objects. In particular, we focus on the curve progression telling us how objects spread across the landscape. For instance, sinuosities of rivers provide important information about imperilled locations in the case of flood waters. However, precise geometrical descriptions are overdetermined and frequently difficult or sometimes impossible to obtain. By contrast, we introduce a concept which allows curves to be classified on the basis of a qualitative representation that defines properties of linear objects, which derive from how segments of objects are located relative to other segments, arriving at conclusions such as how twisty a curve is. Especially, the new method can be applied if only coarse information is available and even then if objects are given incompletely.
منابع مشابه
Enumerations of plane meanders
A closed plane meander of order n is a closed self-avoiding loop intersecting an infinite line 2n times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm, based on transfer matrix methods, for the enumeration of plane meanders. This allows us to calculate the number of closed meanders up to n = 24. The algorithm is eas...
متن کاملA transfer matrix approach to the enumeration of plane meanders
A closed plane meander of order n is a closed self-avoiding curve intersecting an infinite line 2n times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm, based on transfer matrix methods, for the enumeration of plane meanders. While the algorithm has exponential complexity, its rate of growth is much smaller than tha...
متن کاملMeanders and Stamp Foldings: Fast Generation Algorithms
By considering a permutation representation for meanders, semi-meanders, and stamp foldings we construct a new data structure that will allow us to extend the order of a given meander, semi-meander, or stamp folding in constant time. Then using this data structure, we develop a constant amortized time algorithm to generate all semi-meanders of order n. By maintaining the wind-factor for semi-me...
متن کاملStamp Foldings, Semi-Meanders, and Open Meanders: Fast Generation Algorithms
By considering a permutation representation for stamp-foldings and semi-meanders we construct tree-like data structures that will allow us to generate these objects in constant amortized time. Additionally, by maintaining the wind-factor and applying an additional optimization, the algorithm for semi-meanders can be modified to produce the fastest known algorithm to generate open meanders.
متن کاملOn the Representation of Meanders
We will introduce a new approach for studying plane meanders. The set of all meanders of order n possesses a natural order structure and forms a graded poset. We will show how these representations can be used to develop an efficient and very flexible construction algorithm and how to obtain counting formulae for meanders.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006